An Overview of Cuckoo Hashing
نویسنده
چکیده
Cuckoo Hashing is a technique for resolving collisions in hash tables that produces a dictionary with constant-time worst-case lookup and deletion operations as well as amortized constant-time insertion operations. First introduced by Pagh in 2001 [3] as an extension of a previous static dictionary data structure, Cuckoo Hashing was the first such hash table with practically small constant factors [4]. Here, we first outline existing hash table collision policies and go on to analyze the Cuckoo Hashing scheme in detail. Next, we give an overview of (c, k)-universal hash families, and finally, we summarize some selected experimental results comparing the varied collision policies.
منابع مشابه
An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations
Cuckoo hashing is a hash table data structure introduced in [1], that offers constant worst case search time. As a major contribution of this paper, we analyse modified versions of this algorithm with improved performance. Further, we provide an asymptotic analysis of the search costs of all this variants of cuckoo hashing and compare this results with the well known properties of double hashin...
متن کاملOn risks of using a high performance hashing scheme with common universal classes
The contribution of this thesis is a mathematical analysis a high performance hashing scheme called cuckoo hashing when combined with two very simple and efficient classes of functions that we refer to as the multiplicative class and the linear class, respectively. We prove that cuckoo hashing tends to work badly with these classes. In order to show this, we investigate how the inner structure ...
متن کاملNotes about d-cuckoo hashing
We show an upper bound for the minimal size set of keys which cannot be inserted into a d-cuckoo hashing table independently of the hashing functions and the insertion algorithm. We also discuss the probability for a successful insertion into such a hash table.
متن کاملMore Robust Hashing: Cuckoo Hashing with a Stash
Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that there is a polynomially small but practically significant probability that a failure occurs during the insertion of an item, requiring an expensive rehashing of all items in the table. In this paper, we show that this failu...
متن کاملCuckoo Hashing for Undergraduates
This lecture note presents and analyses two simple hashing algorithms: “Hashing with Chaining”, and “Cuckoo Hashing”. The analysis uses only very basic (and intuitively understandable) concepts of probability theory, and is meant to be accessible even for undergraduates taking their first algorithms course.
متن کامل